\textit{and if $\hat{z}$ is second stage feasible, then $\hat{C}$, where}
\begin{equation}
\hat{C}=\sum_{e\in E}C_{e,\hat{l}}\hspace{1mm}z_{e,\hat{l}}
\label{eq:hist30}
\end{equation}
\begin{spacing}{1.5}
\textit{serves as an upper bound for the cost of capacity expansion investments. If $\hat{z}$ is not second stage feasible, then the original SNCE-1 problem is infeasible.}
\end{spacing}
\vspace{5mm}

DS98 full We present a cutting plane algorithm for solving the following
telecommunications network design problem: given point-topoint
traffic demands in a network, specified survivability requirements
and a discrete cost/capacity function for each link,
find minimum cost capacity expansions satisfying the given
demands





Where $ x_{1,1,0}$ represents the flow passing through $ p_{1}$ for meeting demand $d_{1}$ under scenario $ s_{0}$ and so on. 